Recursively Divisible Problems

A Valuation Theoretic Characterization of Recursively saturated Real Closed Fields

We give a valuation theoretic characterization for a real closed field to be recursively saturated. This builds on work in in [KKMZ02], where the authors gave such a characterization for κ-saturation, for a cardinal κ ≥ א0. Our result extends the characterization of Harnik and Ressayre [HR] for a divisible ordered abelian group to be recursively saturated.

Non - Primes Are Recursively Divisible

In this article an inherent characteristics of the non-prime numbers of recursively holding the divisibility property is studied. The recursive property applies to any number system by virtue drawing some necessary conclusions. 2000 Mathematics Subject Classification: 11A51, 11K16.

Semi-G-filters, Stonean filters, MTL-filters, divisible filters, BL-filters and regular filters in residuated lattices

At present, the filter theory of $BL$textit{-}algebras has been widelystudied, and some important results have been published (see for examplecite{4}, cite{5}, cite{xi}, cite{6}, cite{7}). In other works such ascite{BP}, cite{vii}, cite{xiii}, cite{xvi} a study of a filter theory inthe more general setting of residuated lattices is done, generalizing thatfor $BL$textit{-}algebras. Note that fil...

Scheduling Under Power and Energy Constraints

Given a system model where machines have distinct speeds and power ratings but are otherwise compatible, we consider various problems of scheduling under resource constraints on the system which place the restriction that not all machines can be run at once. These can be power, energy, or makespan constraints on the system. Given such constraints, there are problems with divisible as well as no...

Characterizing the Multiplicative Group of a Real Closed Field in Terms of its Divisible Maximal Subgroup